An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
نویسندگان
چکیده
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindrical tree with a polynomial constraint. We have implemented our algorithm in Maple. The experimentation shows that the proposed algorithm outperforms existing ones for many examples taken from the literature.
منابع مشابه
Computing Smooth Feedback Plans Over Cylindrical Algebraic Decompositions
In this paper, we construct smooth feedback plans over cylindrical algebraic decompositions. Given a cylindrical algebraic decomposition on R, a goal state xg , and a connectivity graph of cells reachable from the goal cell, we construct a vector field that is smooth everywhere except on a set of measure zero and the integral curves of which are smooth (i.e., C∞) and arrive at a neighborhood of...
متن کاملDivide-And-Conquer Computation of Cylindrical Algebraic Decomposition
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results using the algorithm first introduced in [34]. We propose a graph-based heuristic to find a suitable partitioning ...
متن کاملProblem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with respect to the truth of logical formulae rather than the signs of polynomials; and CAD construction by regular chains technology, where first a complex decomp...
متن کاملAdjacency Algorithms for Cylindrical Algebraic Decompositions of Three and Higher Dimensional Space I: Adjacencies over a Non-nullifying F0,1g Adjacency
Let A be a set of trivariate irreducible integral polynomials and let D be an A-invariant cylindrical algebraic decomposition (cad) of three-dimensional space. This paper presents a new algorithm for determining the interstack adjacencies in D over a given non-nullifying (for A) 0-cell, 1-cell adjacency in the cad D 0 of the plane induced by D. We show that this new adjacency algorithm for thre...
متن کاملCylindrical Algebraic Sub-Decompositions
Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals. In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae. We discuss several ways to construct sub-CADs, both ...
متن کامل